Parallizing the Push-Relabel Max Flow Algorithm
نویسندگان
چکیده
We parallelized Goldberg’s push-relabel max flow algorithm and its global update heuristic. We achieve a speedup of 2 for the global update heuristic on wide rm f graphs when run on 8 processors. We also implemented a version of the global update heuristic that can run concurrently with the parallel pushrelabel code. The best parallel push-relabel algorithm showed a speedup of 2 on longer rm f graphs and outperformed Goldberg’s hipr code when run on 8 processors.
منابع مشابه
A New Push-Relabel Algorithm for Sparse Networks
In this paper, we present a new push-relabel algorithm for the maximum flow problem on flow networks with n vertices and m arcs. Our algorithm computes a maximum flow in O(mn) time on sparse networks where m = O(n). To our knowledge, this is the first O(mn) time push-relabel algorithm for the m = O(n) edge case; previously, it was known that push-relabel implementations could find a max-flow in...
متن کاملTwo-Level Push-Relabel Algorithm for the Maximum Flow Problem
We describe a two-level push-relabel algorithm for the maximum flow problem and compare it to the competing codes. The algorithm generalizes a practical algorithm for bipartite flows. Experiments show that the algorithm performs well on several problem families.
متن کاملChapter 1 Network Flow - COMP 5703 Course Note Update
The Push-Relabel, or Preflow-Push, Maximum-Flow algorithm was originally developed by Andrew V. Goldberg and Robert E. Tarjan in the mid-to-late 1980s, [2, 3]. This Push-Relabel algorithm is unlike the previous Ford-Fulkerson and Edmonds-Karp algorithms which use the concept of an augmenting path to determine the maximum flow. This algorithm instead uses a concept of a preflow, originally devel...
متن کاملAn Auction Algorithm for the Max - Flow Problem 1 ' 2
We propose a new algorithm for the max-flow problem. It consists of a sequence of augmentations along paths constructed by an auction-like algorithm. These paths are not necessarily shortest, that is, they need not contain a minimum number of arcs. However, they can be found typically with much less computation than the shortest augmenting paths used by competing methods. Our algorithm outperfo...
متن کاملInvestigations on push-relabel based algorithms for the maximum transversal problem
We investigate the push-relabel algorithm for solving the problem of finding a maximum cardinality matching in a bipartite graph in the context of the maximum transversal problem. We describe in detail an optimized yet easy-to-implement version of the algorithm and fine-tune its parameters. We also introduce new performance-enhancing techniques. On a wide range of real-world instances, we compa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010